Non-standard approaches to integer programming

Non-standard approaches to integer programming

In this survey we address three of the principal algebraic approaches to integer programming. After introducing lattices and basis reduction, we 0rst survey their use in integer programming, presenting among others Lenstra’s algorithm that is polynomial in 0xed dimension, and the solution of diophanine equations using basis reduction. The second topic concerns augmentation algorithms and test s...

New Approaches to Integer Programming

Polyhedral Approaches to Mixed Integer Linear Programming

This survey presents tools from polyhedral theory that are used in integer programming. It applies them to the study of valid inequalities for mixed integer linear sets, such as Gomory’s mixed integer cuts.

Integer linear programming approaches for non-unique probe selection

In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their ability to assess the presence or absence of biological agents, the targets, in a sample. Given a collection of genetic sequences of targets one faces the challenge of finding short oligonucleotides, the probes, which allow...

Reconstructing Convex Matrices by Integer Programming Approaches

We consider the problem of reconstructing two-dimensional convex binary matrices from their row and column sums with adjacent ones. Instead of requiring the ones to occur consecutively in each row and column, we maximize the number of adjacent ones. We reformulate the problem by using integer programming and we develop approximate solutions based on linearization and convexification techniques.